Software verification for programmable logic controllers

نویسنده

  • Ralf Huuck
چکیده

ion Abstraction is a fundamental concept used in all formal verification methods. Abstracting means replacing a concrete object with an abstract one which is more universal, and therefore, often has a simpler structure than before. A well-chosen abstraction simplifies as much as possible, without losing too much information about the concrete object. Abstractions can be used in different ways during the specification and verification process:ion is a fundamental concept used in all formal verification methods. Abstracting means replacing a concrete object with an abstract one which is more universal, and therefore, often has a simpler structure than before. A well-chosen abstraction simplifies as much as possible, without losing too much information about the concrete object. Abstractions can be used in different ways during the specification and verification process: • Building the system model: Every translation from a real-life system or an informal system description into a formal model is an abstraction. • Optimizing the system model: Depending on the property that is to be checked, different abstractions of the system model can be useful, e.g., by abstracting from data, time, or continuous variables to obtain simpler models. • Reducing the complexity of model checking: Model-checkers often use abstractions to minimize time and space usage, e.g., by introducing symbolic states. When abstracting a system model, often a so-called safe abstraction is chosen: Whenever a property holds for the abstract system, it also holds for the concrete system. The converse, however, does not always hold, due to the over-approximation which occurs in the abstraction process. A positive model checking result on a safe abstraction therefore means that the concrete system also fulfills the property, whereas a negative result can either mean that the concrete system is not correct or that the abstraction is too coarse. Thus, when getting a negative result, the counterexample provided by the model-checker is examined to see if the error will also occur in the concrete system. If it doesn’t, a finer abstraction has to be chosen.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers

This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...

متن کامل

Modular Verification of Programmable Logic Controllers with Tla

With the increasing use of computers in manufacturing, the quality of the production process becomes increasingly dependent on the software used in these systems. This paper describes the use of Lamport’s Temporal Logic of Actions (TLA) for the modular verification of programmable logic controllers (PLCs). First, a way to formulate abstract specifications for function blocks as defined in IEC 1...

متن کامل

An Exploratory Method for Effective Deployment of Programmable Logic Controllers (PLCs)

This paper presents a preliminary study of an approach that models programmable logic controllers (PLCs) for their effective deployment in industrial control processes. A working model is developed for automatic allocation of PLCs and also a formal verification of Ladder Diagram representations of control processes using the Symbolic Model Verifier (SMV) tool. Automatic resource allocation is a...

متن کامل

Combining Software Methods for Effective Deployment of Programmable Logic Controllers (PLCs)

This paper presents a preliminary study of an approach that models programmable logic controllers (PLCs) for their effective deployment in industrial control processes. A working model is developed for automatic allocation of PLCs and also a formal verification of Ladder Diagram representations of control processes using the Symbolic Model Verifier (SMV) tool. Automatic resource allocation is a...

متن کامل

Model-based Design of Code for PLC Controllers

This paper describes a method for model-based development of software for programmable logic controllers (PLC). The method includes modeling of a control algorithm, verifying the algorithm with respect to the requirements, and automatically generating the code in one of the IEC 61131 languages. The modeling language is UML state machine diagram, and the verification tool is UPPAAL model-checkin...

متن کامل

Formal Verification of PLC Programs

This paper presents an approach to the verification of programs for programmable logic controllers (PLCs) using SMV, a software package for formal verification of state transition systems. Binary PLC programs are converted directly into SMV modules that retain the variable names and execution sequences of the original programs. The system being controlled is modeled by a C/E system block diagra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003